Equivalence and Tractability Results for SAS+ Planning
نویسنده
چکیده
We deene the SAS + planning formalism, which generalizes the previously presented SAS formalism. The SAS + formalism is compared with some better-known propositional-planning formalisms with respect to expres-siveness. Contrary to intuition, all formalisms turn out to be equally expressive in a very strong sense. We further present the SAS +-PUS planning problem which generalizes the previously presented, tractable SAS-PUS problem. We prove that also the SAS +-PUS problem is tractable by devising a prov-ably correct polynomial time algorithm for this problem.
منابع مشابه
Planning in polynomial time: the SAS-PUBS class
This article describes a polynomial-time,O(n), planning algorithm for a limited class of planning problems. Compared to previous work on complexity of algorithms for knowledge-based or logic-based planning, our algorithm achieves computational tractability, but at the expense of only applying to a signi cantly more limited class of problems. Our algorithm is proven correct, and it always return...
متن کاملExpressive Equivalence of Planning Formalisms
A concept of expressive equivalence for planning formalisms based on polynomial transformations is de ned. It is argued that this de nition is reasonable and useful both from a theoretical and from a practical perspective; if two languages are equivalent, then theoretical results carry over and, more practically, we can model an application problem in one language and then easily use a planner ...
متن کاملA Multi-Year Scenario-Based Transmission Expansion Planning Model Incorporating Available Transfer Capability
This paper presents a multi-year scenario-based methodology for transmission expansion planning (TEP) in order to enhance the available transfer capability (ATC). The ATC is an important factor for all players of electricity market who participate in power transaction activities and can support the competition and nondiscriminatory access to transmission lines among all market participants. The...
متن کاملOn the numerical solution of integral equations of the fourth kind with higher index: differentiability and tractability index-3
In this paper, we consider a particular class of integral equations of the fourth kind and show that tractability and differentiability index of the given system are 3. Tractability and dierentiability index are introduced based on the-smoothing property of a Volterra integral operator and index reduction procedure, respectively. Using the notion of index, we give sucient conditions for the exi...
متن کاملComplexity Results for Sas + Planning Christer Bb Ackstrr Om
We have previously reported a number of tractable planning problems deened in the SAS + formalism. This report complements these results by providing a complete map over the complexity of SAS + planning under all combinations of the previously considered restrictions. We analyze the complexity both of nding a minimal plan and of nd-ing any plan. In contrast to other complexity surveys of planni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992